Distributive semantics for nondeterministic typed λ-calculi
نویسندگان
چکیده
منابع مشابه
Model-Checking Games for Typed λ-Calculi
We consider the transfer of verification techniques to structures with binding.
متن کاملContinuation Semantics in Typed Lambda-Calculi (Summary)
1. Abstract. This paper reports preliminary work on the semantics of the continuation transform. Previous work on the semantics of continuations has concentrated on untyped lambda-calculi and has used primarily the mechanism of inclusive predicates. Such predicates are easy to understand on atomic values, but they become obscure on functional values. In the case of the typed lambda-calculus, we...
متن کاملDialgebraic Semantics of Typed Object Calculi
Algebraic data type theory has a notion of structural recursion. Coalgebraic data types similarly have a notion of structural corecursion. In this thesis we study a third form of recursion: direcursion. The other two notions have been used in program derivations, correctness proofs, and in foundations of functional and class-based languages. Direcursion, on the other hand, has not been extensiv...
متن کاملA general method for proving the normalization theorem for first and second order typed λ-calculi
ion Γ, x:α `λ→2 b(x) : β Γ `λ→2 b : α→ β where the only free occurrence of x in b(x) is the manifested one. It is an immediate consequence of the way the new system is defined that the algorithm of normalization of the previous section terminates if applied to any one of the new terms. V. Capretta and S. Valentini 722 2.3. Equivalence between the two systems Now, to conclude the proof of normal...
متن کاملA general method to prove the normalization theorem for first and second order typed λ - calculi
ion Γ, x:α ⊢λP× b : β Γ ⊢ λ P × (λx:α.b) : (∀x:α) β Application Γ ⊢ λ× c : (∀x:α) β Γ ⊢ λ× a : α Γ ⊢ λ× c(a) : β[x := a] n-tuple formation Γ ⊢ λ× a1 : α1 . . . Γ ⊢λP× an : αn Γ ⊢ λ× < a1, . . . , an >: α1 × . . .× αn Selection Γ ⊢ λ× a : α1 × . . .× αn Γ ⊢λP× a(i) : αi 1 ≤ i ≤ n A general method to prove the normalization theorem 7 In the selection rule we used the unusual notation a(i) to indi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1984
ISSN: 0304-3975
DOI: 10.1016/0304-3975(84)90027-6